Analysis of an Open Tandem Queueing Network with Population Constraint and Constant Service Times

We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be presented in the network can not exceed a given value K. Customers arriving at the queueing network when there are more than K customers are forced to wait in an external queue. The arrival process to the queueing network is assumed to be arbitrary. We show that this queueing network can be transformed into a simple network involving only two nodes. Using this simple network, we obtain an upper and lower bound on the mean waiting time. These bounds can be easily calculated. Validations against simulation data establish the tightness of these.